Verifying properties of process definitions
نویسندگان
چکیده
منابع مشابه
Verifying Business Process Compatibility
We describe a process-algebraic approach to verifying process interactions for business collaboration described in Business Process Modelling Notation. We first overview our process semantics for BPMN in the language of Communicating Sequential Processes; we then use a simple example of business collaboration to demonstrate how our semantic model may be used to verify compatibility between busi...
متن کاملVerifying persistent security properties
We study bisimulation-based information 0ow security properties which are persistent, in the sense that if a system is secure then all of its reachable states are secure too. We show that such properties can be characterized in terms of bisimulation-like equivalence relations, between the full system and the system prevented from performing con3dential actions. Moreover, we provide a characteri...
متن کاملVerifying Emergent Properties of Swarms
We investigate the general problem of establishing whether a swarm satisfies an emergent property. We put forward a formal model for swarms that accounts for their nature of unbounded collections of agents following simple local protocols. We formally define the decision problem of determining whether a swarm satisfies an emergent property. We introduce a sound and complete procedure for solvin...
متن کاملVerifying Properties of Neural Networks
In the beginning of nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation. She also established the equivalence between the ARNN and other analog systems that support hypercomputation, launching the foundations of an alternative computational theory. In this paper we contribute to this alte...
متن کاملVerifying Temporal Properties of Processes
1 Motivation Many interesting concurrent systems have innnite state spaces: examples include concurrent while programs; Petri Nets; CCS (or CSP) processes with value passing. All of these examples can be interpreted operationally as innnite labelled transition systems, structures of the form (P; f a ?! : a 2 L g) where P is a set of points (states, markings, processes) and a ?! the appropriate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGSOFT Software Engineering Notes
سال: 2000
ISSN: 0163-5948
DOI: 10.1145/347636.348876